In this monograph, p-adic period domains are associated to arbitrary reductive groups. Using the concept of rigid-analytic period maps, the relation of p-adic period domains to moduli space of p-divisible groups is investigated. In addition, non-archimedean uniformization theorems for general Shimura varieties are established. The exposition includes background material on Grot...(展开全部)

In this monograph, p-adic period domains are associated to arbitrary reductive groups. Using the concept of rigid-analytic period maps, the relation of p-adic period domains to moduli space of p-divisible groups is investigated. In addition, non-archimedean uniformization theorems for general Shimura varieties are established. The exposition includes background material on Grot...(展开全部)

"Spaces for Consumption" offers an in-depth and sophisticated analysis of the processes that underpin the commodification of the city and explains the physical manifestation of consumerism as a way of life. Engaging directly with the social, economic and cultural processes that have resulted in our cities being defined through consumption, this vibrant book clearly demonstrates...(展开全部)

The Langlands Program was conceived initially as a bridge between Number Theory and Automorphic Representations, and has now expanded into such areas as Geometry and Quantum Field Theory, tying together seemingly unrelated disciplines into a web of tantalizing conjectures. A new chapter to this grand project is provided in this book. It develops the geometric Langlands Correspo...(展开全部)

The Langlands Program was conceived initially as a bridge between Number Theory and Automorphic Representations, and has now expanded into such areas as Geometry and Quantum Field Theory, tying together seemingly unrelated disciplines into a web of tantalizing conjectures. A new chapter to this grand project is provided in this book. It develops the geometric Langlands Correspo...(展开全部)

This course is offered to undergraduates and is an elementary discrete mathematics course oriented towards applications in computer science and engineering. Topics covered include: formal logic notation, induction, sets and relations, permutations and combinations, counting principles, and discrete probability.